Entropy and the Shattering Dimension

نویسنده

  • Shahar Mendelson
چکیده

The Shattering dimension of a class is a real-valued version of the Vapnik-Chervonenkis dimension. We will present a solution to Talagrand’s entropy problem, showing that the L2-covering numbers of every uniformly bounded class of functions are exponential in the shattering dimension of the class. Formally we prove that there are absolute constants K and c such that for every 0 < t ≤ 1 and any probability measure μ, N(t, F, L2(μ)) ≤ (2/t)Kvc(F,ct), where F is a class of functions bounded by 1 and vc(F, t) is the shattering dimension at scale t. This extends a result of Dudley from the Boolean case to the realvalued one. This result has many applications in the theory of empirical processes (e.g. identifying classes which satisfy the uniform CLT using their shattering dimension), convex geometry (optimal Elton’s Theorem on sign-embeddings of 1 , and the fact that if the Euclidean entropy of a convex body is ”large” at a scale t then there exists a highdimensional cube of side ct contained in a coordinate projection of the body) and in Learning Theory (improved generalization bounds in terms of the shattering dimension).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entropy, Combinatorial Dimensions and Random Averages

In this article we introduce a new combinatorial parameter which generalizes the VC dimension and the fat-shattering dimension, and extends beyond the function-class setup. Using this parameter we establish entropy bounds for subsets of the n-dimensional unit cube, and in particular, we present new bounds on the empirical covering numbers and gaussian averages associated with classes of functio...

متن کامل

Se p 20 02 Entropy and the Combinatorial Dimension

We solve Talagrand’s entropy problem: the L2-covering numbers of every uniformly bounded class of functions are exponential in its shattering dimension. This extends Dudley’s theorem on classes of {0, 1}valued functions, for which the shattering dimension is the VapnikChervonenkis dimension. In convex geometry, the solution means that the entropy of a convex body K is controlled by the maximal ...

متن کامل

Shattering-Extremal Set Systems of VC Dimension at most 2

We say that a set system F ⊆ 2[n] shatters a given set S ⊆ [n] if 2S = {F ∩ S : F ∈ F}. The Sauer inequality states that in general, a set system F shatters at least |F| sets. Here we concentrate on the case of equality. A set system is called shattering-extremal if it shatters exactly |F| sets. In this paper we characterize shattering-extremal set systems of Vapnik-Chervonenkis dimension 2 in ...

متن کامل

Bounding the Fat Shattering Dimension of a Composition Function Class Built Using a Continuous Logic Connective

We begin this report by describing the Probably Approximately Correct (PAC) model for learning a concept class, consisting of subsets of a domain, and a function class, consisting of functions from the domain to the unit interval. Two combinatorial parameters, the Vapnik-Chervonenkis (VC) dimension and its generalization, the Fat Shattering dimension of scale ǫ, are explained and a few examples...

متن کامل

Shattering-Extremal Systems

The Shatters relation and the VC dimension have been investigated since the early seventies. These concepts have found numerous applications in statistics, combinatorics, learning theory and computational geometry. Shattering extremal systems are set-systems with a very rich structure and many different characterizations. The goal of this thesis is to elaborate on the structure of these systems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002